#include <algorithm>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <istream>
#include <vector>
using ll = int64_t;
#define printf
const ll p=9901;
ll n,k;
std::vector<std::vector<ll>> dp;

int main(){
    std::iostream::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin>>n>>k;
    dp.resize(n+1,std::vector<ll>(k+1));
    for(ll i=1;i<=k;i++)dp[1][i]=1;
    for(ll i=3;i<=n;i+=2){
        for(ll j=2;j<=k;j++){
            for(ll k=1;k<i;k+=2){
                dp[i][j]+=dp[i-k-1][j-1]*dp[k][j-1]%p;
                dp[i][j]%=p;
            }
            printf("dp[%lld][%lld]=%lld\n",i,j,dp[i][j]);
        }
    }
    std::cout<<(dp[n][k]-dp[n][k-1]+p)%p<<"\n";
}